Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö ÄÄÇ»ÅÍ ¹× Åë½Å½Ã½ºÅÛ
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
¼¾¼ ³×Æ®¿öÅ©¿¡¼ ½Ç½Ã°£ ħÀÔŽÁö ¶ó¿ìÆÃÀ» À§ÇÑ´Ù¸ñÀû °³¹Ì ±ºÁý ÃÖÀûÈ ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
A Multi-objective Ant Colony Optimization Algorithm for Real Time Intrusion Detection Routing in Sensor Network |
ÀúÀÚ(Author) |
°½ÂÈ£
Seung-Ho Kang
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 02 NO. 05 PP. 0191 ~ 0198 (2013. 05) |
Çѱ۳»¿ë (Korean Abstract) |
À̵¿ÇÏ´Â º£À̽º ³ëµå¸¦ °¡Áø ¹«¼± ¼¾¼ ³×Æ®¿öÅ©(WSN)¿¡¼ ½Ç½Ã°£ ħÀÔŽÁö¸¦ À§Çؼ´Â ħÀÔÀ» ŽÁöÇÑ ¼¾¼·ÎºÎÅÍ º£À̽º ³ëµå±îÁöÀÇ Á¤º¸ Àü´ÞÀÌ ÂªÀº ¶ó¿ìÆà °æ·Î¸¦ ÅëÇØ ÀÌ·ç¾îÁ®¾ß ÇÑ´Ù. ¼¾¼ ³×Æ®¿öÅ©¿¡¼ ÃÖ¼Ò Wiener¼ö ½ÅÀåÆ®¸®(MWST)±â¹Ý ¶ó¿ìÆà ¹æ¹ýÀº ÃÖ¼Ò ½ÅÀåÆ®¸®(MST)±â¹Ý ¶ó¿ìÆà ¹æ¹ý¿¡ ºñÇØ ÀÛÀº È© ¼ö¸¦ º¸ÀåÇÏ°í ÀÖ¾î¼ ½Ç½Ã°£ ħÀÔŽÁö¿¡ ÀûÇÕÇÔÀÌ ¾Ë·ÁÁ® ÀÖ´Ù. ÇÏÁö¸¸ ÁÖ¾îÁø ³×Æ®¿öÅ©·ÎºÎÅÍ ÃÖ¼Ò Wiener ¼ö ½ÅÀåÆ®¸®¸¦ ã´Â ¹®Á¦´Â NP-hardÀÌ°í ƯÁ¤ ³ëµå¿¡ ´ëÇÑ ÀÇÁ¸¼ºÀÌ Ä¿¼ ÃÖ¼Ò ½ÅÀå Æ®¸® ±â¹Ý ¶ó¿ìÆà ¹æ¹ý¿¡ ºñÇØ ÂªÀº ³×Æ®¿öÅ© ¼ö¸íÀ» °®´Â ´ÜÁ¡ÀÌ ÀÖ´Ù. º» ³í¹®Àº ½Ç½Ã°£ ħÀÔŽÁö¸¦ À§ÇØ ÃÖ¼Ò Wiener¼ö ½ÅÀåÆ®¸®¸¦ °³¼±ÇØ ÀÛÀº È© ¼ö¿Í ±ä ³×Æ®¿öÅ©ÀÇ ¼ö¸íÀ» µ¿½Ã¿¡ º¸ÀåÇÏ´Â ¶ó¿ìÆà Ʈ¸®¸¦ ã´Â ´Ù¸ñÀû °³¹Ì ±ºÁý ÃÖÀûÈ ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. ±×¸®°í Á¦¾ÈÇÑ ¶ó¿ìÆà Ʈ¸®ÀÇ ¼º´ÉÀ» ÆÐŶÀÇ Æò±Õ Àü¼Û È© ¼ö ¹× ³×Æ®¿öÅ© Àü·Â ¼Ò¸ð, ³×Æ®¿öÅ©ÀÇ ¼ö¸í Ãø¸é¿¡¼ ÃÖ¼Ò ½ÅÀåÆ®¸®±â¹Ý ¶ó¿ìÆà ¹æ¹ý ¹× ÃÖ¼Ò Wiener¼ö ½ÅÀåÆ®¸®±â¹Ý ¶ó¿ìÆà ¹æ¹ý°ú ºñ±³ÇÑ´Ù. |
¿µ¹®³»¿ë (English Abstract) |
It is required to transmit data through shorter path between sensor and base node for real time intrusion detection in wireless sensor networks (WSN) with a mobile base node. Because minimum Wiener index spanning tree (MWST) based routing approach guarantees lower average hop count than that of minimum spanning tree (MST) based routing method in WSN, it is known that MWST based routing is appropriate for real time intrusion detection. However, the minimum Wiener index spanning tree problem which aims to find a
spanning tree which has the minimum Wiener index from a given weighted graph was proved to be a NP-hard. And owing to its high dependency on certain nodes, minimum Wiener index tree based routing method has a shorter network lifetime than that of minimum spanning tree based routing method. In this paper, we propose a multi-objective ant colony optimization algorithm to tackle these problems, so that it can be used to detect intrusion in real time in wireless sensor networks with a mobile base node. And we compare the results of our proposed method with MST based routing and MWST based routing in respect to average hop count, network energy consumption and network lifetime by simulation.
|
Å°¿öµå(Keyword) |
Multi-Objective Ant Colony Optimization Algorithm
Realtime Intrusion Detection
Wireless Sensor Networks
Minimum Wiener Spanning Tree
´Ù¸ñÀû °³¹Ì ±ºÁý ÃÖÀûÈ ¾Ë°í¸®Áò
½Ç½Ã°£ ħÀÔŽÁö
¹«¼± ¼¾¼ ³×Æ®¿öÅ©
ÃÖ¼Ò Wiener ¼ö ½ÅÀåÆ®¸®
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|